Least-recently-used caching with dependent requests
نویسندگان
چکیده
منابع مشابه
Least-recently-used caching with dependent requests
We investigate a widely popular least-recently-used (LRU) cache replacement algorithmwith semiMarkov modulated requests. Semi-Markov processes provide the flexibility for modeling strong statistical correlation, including the widely reported long-range dependence in theWorldWideWeb page request patterns. When the frequency of requesting a page n is equal to the generalized Zipf’s law c/n , > 1,...
متن کاملLeast Recently Used Caching with Zipf’s Law Requests
Least Recently Used (LRU) cache replacement rule is at the core of many replacement algorithms in modern distributed networks. The wide popularity of this rule is primarily due to its high performance, self-organizing nature and ease of implementation. Therefore, in order to further the insights of designing network caching protocols, it is important to gain a thorough understanding of the base...
متن کاملAsymptotic Insensitivity of Least-Recently-Used Caching to Statistical Dependency
We investigate a widely popular Least-RecentlyUsed (LRU) cache replacement algorithm with semi-Markov modulated requests. Semi-Markov processes provide the flexibility for modeling strong statistical correlation, including the broadly reported long-range dependence in the World Wide Web page request patterns. When the frequency of requesting a page n is equal to the generalized Zipf’s law c/n, ...
متن کاملLeast Recently Used Caching in the Presence of Statistical Locality
Least Recently Used cache replacement rule is at the core of many replacement algorithms in modern distributed networks. The wide popularity of this rule is primarily due to its high performance, self-organizing nature and ease of implementation. Therefore, in order to further the insights of designing network caching protocols, it is important to gain a thorough understanding of the baseline L...
متن کاملIntegration of Least Recently Used Algorithm and Neuro-Fuzzy System into Client-side Web Caching
Web caching is a well-known strategy for improving performance of Web-based system by keeping web objects that are likely to be used in the near future close to the client. Most of the current Web browsers still employ traditional caching policies that are not efficient in web caching. This research proposes a splitting client-side web cache to two caches, short-term cache and long-term cache. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.07.029